Pii: S0898-1221(99)00323-5
نویسنده
چکیده
K e y w o r d s P r o j e c t i o n , Simplex method, Least squares problem, LU decomposition, Crash heuristic. 1. I N T R O D U C T I O N We are concerned with the Linear P rogramming (LP) problem in the s t anda rd form
منابع مشابه
Pii: S0898-1221(99)00168-6
Abstrac t -We consider in this paper, an r-quorum queueing system with random server capacity under N-policy discipline (hysteretic system). We find a necessary and sufficient condition for ergodicity, the probability generating function of the steady state vector of probabilities for the embedded process and the continuous time parameter, and some system characteristics. The decomposition prop...
متن کاملPii: S0898-1221(99)00192-3
We consider the following boundary value problem: where 1 < p _< n-1 is fixed and A > 0. A characterization of the values of A is carried out so that the boundary value problem has a positive solution. Next, for A = 1, criteria are developed for the existence of two positive solutions of the boundary value problem. In addition, for particular cases we also offer upper and lower bounds for these...
متن کاملAn Algorithm for the Optimal Consistent Approximation to a Pairwise Comparisons Matrix by Orthogonal Projections
The algorithm for finding the optimal consistent approximation of an inconsistent pairwise comaprisons matrix is based on a logarithmic transformation of a pairwise comparisons matrix into a vector space with the Euclidean metric. Orthogonal basis is introduced in the vector space. The orthogonal projection of the transformed matrix onto the space formed by the images of consistent matrices is ...
متن کاملMoving-Mesh Methods for One-Dimensional Hyperbolic Problems Using CLAWPACK
1. I N T R O D U C T I O N We study high-resolution finite-volume methods for the one-dimensional conservation law qt + f (q ) z = ~ (x ,q ) (1) on a moving grid, where the interface x~ between grid cells varies with time t~. Figure 1 shows a typical moving grid over one time step. We show how the wave-propagation algorithms developed in [1] and implemented in the CLAWPACK software [2] can be m...
متن کاملPii: S0898-1221(01)00281-4
Abst rac t -Dynamic rent-seeking games with nonlinear cost functions are analyzed. The local asymptotic stability of the solution is first examined. We show that in the absence of a dominant agent, all eigenvalues of the Jacobian are real. Conditions are given for the local asymptotic stability as well as for the local instability of the equilibrium. In the presence of a dominant agent, complex...
متن کامل